Randomized algorithms

Results: 419



#Item
11Charles University in Prague Faculty of Mathematics and Physics DOCTORAL THESIS  Jan Bul´anek

Charles University in Prague Faculty of Mathematics and Physics DOCTORAL THESIS Jan Bul´anek

Add to Reading List

Source URL: iuuk.mff.cuni.cz

Language: English - Date: 2014-07-29 07:02:19
12The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T.  Carg`ese 2011

The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
13Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI  GOLDWASSER,

Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI GOLDWASSER,

Add to Reading List

Source URL: groups.csail.mit.edu

Language: English - Date: 2003-04-15 15:57:50
14I will discuss recent work on randomized algorithms for low-rank approximation and principal component analysis (PCA). The talk will focus on efforts that move beyond the extremely fast, but relatively crude approximatio

I will discuss recent work on randomized algorithms for low-rank approximation and principal component analysis (PCA). The talk will focus on efforts that move beyond the extremely fast, but relatively crude approximatio

Add to Reading List

Source URL: mmds-data.org

Language: English - Date: 2016-06-23 15:50:48
15Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Add to Reading List

Source URL: web.stanford.edu

Language: English - Date: 2014-04-18 04:16:48
16Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗  Christoph Lenzen

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:31
17Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions Pankaj K. Agarwaly Micha Sharirz

Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions Pankaj K. Agarwaly Micha Sharirz

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2012-06-29 10:27:51
18LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2009-01-01 08:42:54
19CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014

CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-29 00:22:18
20Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡  Shaddin Dughmi§

Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡ Shaddin Dughmi§

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-05-11 07:37:06